Simple DFS on the complement of a graph and on partially complemented digraphs
نویسندگان
چکیده
منابع مشابه
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs
A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented digraph G̃ is a digraph obtained from a sequence of vertex complement operations on G. Dahlhaus et al. showed that, given an adjacency-list representation of G̃, depth-first search (DFS) on G can be performed in O(n+ m̃) time, where n is the number...
متن کاملPartially Complemented Representations of Digraphs
A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. This defines an equivalence relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given an adjacency-list representation of a digraph G, many fundamental graph algorithms can be carried out on any...
متن کاملthe effects of multiple intelligences (focus on musical, visual, and linguistic) and direct instruction on learning grammar: a case on iranian efl students at elementary level
1.0 overview it seems that grammar plays a crucial role in the area of second and foreign language learning and widely has been acknowledged in grammar research. in other words, teaching grammar is an issue which has attracted much attention to itself, and a lot of teachers argue about the existence of grammar in language teaching and learning. this issue will remind us a famous sentence f...
a study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension
این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2017
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2016.08.006